Computation of fluctuation scattering profiles via three-dimensional Zernike polynomials.
نویسندگان
چکیده
Ultrashort X-ray pulses from free-electron laser X-ray sources make it feasible to conduct small- and wide-angle scattering experiments on biomolecular samples in solution at sub-picosecond timescales. During these so-called fluctuation scattering experiments, the absence of rotational averaging, typically induced by Brownian motion in classic solution-scattering experiments, increases the information content of the data. In order to perform shape reconstruction or structure refinement from such data, it is essential to compute the theoretical profiles from three-dimensional models. Based on the three-dimensional Zernike polynomial expansion models, a fast method to compute the theoretical fluctuation scattering profiles has been derived. The theoretical profiles have been validated against simulated results obtained from 300 000 scattering patterns for several representative biomolecular species.
منابع مشابه
Use of Zernike Polynomials and SPGD Algorithm for Measuring the Reflected Wavefronts from the Lens Surfaces
Recently, we have demonstrated a new and efficient method to simultaneously reconstruct two unknown interfering wavefronts. A three-dimensional interference pattern was analyzed and then Zernike polynomials and the stochastic parallel gradient descent algorithm were used to expand and calculate wavefronts. In this paper, as one of the applications of this method, the reflected wavefronts from t...
متن کاملA comparative analysis of algorithms for fast computation of Zernike moments
This paper details a comparative analysis on time taken by the present and proposed methods to compute the Zernike moments, Zpq. The present method comprises of Direct, Belkasim’s, Prata’s, Kintner’s and Coe3cient methods. We propose a new technique, denoted as q-recursive method, speci5cally for fast computation of Zernike moments. It uses radial polynomials of 5xed order p with a varying inde...
متن کاملComputing Zernike polynomials of arbitrary degree using the discrete Fourier transform
The conventional representation of Zernike polynomials Rn (ρ) gives unacceptable numerical results for large values of the degree n. We present an algorithm for the computation of Zernike polynomials of arbitrary degree n. The algorithm has the form of a discrete Fourier (cosine) transform which comes with advantages over other methods in terms of computation time, accuracy and ease of implemen...
متن کاملAn Efficient Algorithm for Fast Computation of Pseudo-Zernike Moments
Pseudo-Zernike moments have better feature representation capabilities and are more robust to image noise than the conventional Zernike moments. However, pseudo-Zernike moments have not been extensively used as feature descriptors due to the computational complexity of the pseudo-Zernike radial polynomials. This paper discusses the drawbacks of the existing methods, and proposes an efficient re...
متن کاملA novel approach to the fast computation of Zernike moments
This paper presents a novel approach to the fast computation of Zernike moments from a digital image. Most existing fast methods for computing Zernike moments have focused on the reduction of the computational complexity of the Zernike 1-D radial polynomials by introducing their recurrence relations. Instead, in our proposed method, we focus on the reduction of the complexity of the computation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Acta crystallographica. Section A, Foundations of crystallography
دوره 68 Pt 5 شماره
صفحات -
تاریخ انتشار 2012